Atoms for signed permutations
نویسندگان
چکیده
منابع مشابه
Pairings and Signed Permutations
Identity (1) is easy to prove: note that the left side is a convolution, so multiply it by xn , sum, and recognize the square of a binomial series. But a combinatorial interpretation of the same identity is not so easy to find. In [3], M. Sved recounts the story of the identity and its combinatorial proofs. She relates how, after she challenged her readers (in a previous article) to find a comb...
متن کاملMacMahon-type Identities for Signed Even Permutations
MacMahon’s classic theorem states that the length and major index statistics are equidistributed on the symmetric group Sn. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group An by Regev and Roichman, for the hyperoctahedral group Bn by Adin, Brenti and Roichman, and for the group of even-signed per...
متن کاملConsensus Ranking with Signed Permutations
Signed permutations (also known as the hyperoctahedral group) are used in modeling genome rearrangements. The algorithmic problems they raise are computationally demanding when not NP-hard. This paper presents a tractable algorithm for learning consensus ranking between signed permutations under the inversion distance. This can be extended to estimate a natural class of exponential models over ...
متن کاملComputing signed permutations of polygons
Given a planar polygon (or chain) with a list of edges {e1, e2, e3, . . . , en−1, en}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider are: reversals which involve inverting the order of a sublist, transpositions which involve interchanging subchains (sublists), and edge-swaps which are a ...
متن کاملGenome Rearrangement Sorting Signed Permutations by Reversals
A model to study genome evolution can be constructed by representing genomes as permutations of genes, and compute the minimum number of rearrangements needed to convert one genome to the other. Under this model, the shorter the distance, the lesser is the evolutionary distance between the two species. However, every study of genome rearrangements involves solving the combinatorial problem refe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2020.103288